Efficient generation of fair dice with few biased coins
نویسندگان
چکیده
Given a random variable X which takes n equiprobable values, we consider several algorithmic questions related to the classical problem of simulating the outcomes of X by using a limited number of biased coins. in the framework of the project: \EEcienza di Algoritmi e Progetto di Strutture Informative".
منابع مشابه
Blind-friendly von Neumann's Heads or Tails
The toss of a coin is usually regarded as the epitome of randomness, and has been used for ages as a means to resolve disputes in a simple, fair way. Perhaps as ancient as consulting objects such as coins and dice is the art of maliciously biasing them in order to unbalance their outcomes. However, it is possible to employ a biased device to produce equiprobable results in a number of ways, the...
متن کاملStreaming Algorithms for Optimal Generation of Random Bits
Generating random bits from a source of biased coins (the biased is unknown) is a classical question that was originally studied by von Neumann. There are a number of known algorithms that have asymptotically optimal information efficiency, namely, the expected number of generated random bits per input bit is asymptotically close to the entropy of the source. However, only the original von Neum...
متن کاملOn Optimal Algorithms for Generating Random Bits from Loaded Dice
The problem of generating random bits from an arbitrary biased coin, dating back to von Neumann’s 1951 work, has been extensively studied. Specifically, given a fixed number of biased coin tosses with unknown probability, it is well known how to generate random bits with an asymptotically optimal efficiency. In this paper we address two basic questions related to the generation of random bits. ...
متن کاملLearning with Limited Rounds of Adaptivity: Coin Tossing, Multi-Armed Bandits, and Ranking from Pairwise Comparisons
In many learning settings, active/adaptive querying is possible, but the number of rounds of adaptivity is limited. We study the relationship between query complexity and adaptivity in identifying the k most biased coins among a set of n coins with unknown biases. This problem is a common abstraction of many well-studied problems, including the problem of identifying the k best arms in a stocha...
متن کاملChildren's Understanding Of Fair Games
The concept of probability may be developed through games and experiments with dice, coins or spinners, which help children in acquiring concepts such as chance, independence and mutually exclusive events (Amit, 1998). Games of chance are one major context where children meet random situations, becoming aware of their unpredictability and realising the need for probabilistic estimates. These ga...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 45 شماره
صفحات -
تاریخ انتشار 1999